A domain model characterising strong normalisation
نویسندگان
چکیده
منابع مشابه
A domain model characterising strong normalisation
Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped λ-calculus with pattern matching and term rewriting which has the property that a term is strongly normalising if its value is not ⊥. There are no disjointness or confluence conditions imposed on the rewrite rules, and under a mild but necessary condition completeness of the method i...
متن کاملCharacterising Strong Normalisation for Explicit Substitutions
We characterise the strongly normalising terms of a composition-free calculus of explicit substititions (with or without garbage collection) by means of an intersection type assignment system. The main novelty is a new cut-rule which allows to forget the context of the minor premise when the context of the main premise does not have an assumption for the cut variable.
متن کاملStrong Normalisation of λLJQ
The purpose of this paper is to prove the claim in [DL06, DL07] that typed terms of λLJQ are terminating.
متن کاملContinuous semantics for strong normalisation
We prove a general strong normalisation theorem for higher type rewrite systems based on Tait's strong computability predicates and a strictly continuous domain-theoretic semantics. The theorem applies to extensions of Gödel's system T , but also to various forms of barrecursion for which strong normalisation was hitherto unknown.
متن کاملResource control and strong normalisation
We introduce the resource control cube, a system consisting of eight intuitionistic lambda calculi with either implicit or explicit control of resources and with either natural deduction or sequent calculus. The four calculi of the cube that correspond to natural deduction have been proposed by Kesner and Renaud and the four calculi that correspond to sequent lambda calculi are introduced in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2008
ISSN: 0168-0072
DOI: 10.1016/j.apal.2008.06.005